Percolation of interdependent networks with intersimilarity
نویسندگان
چکیده
منابع مشابه
Percolation of interdependent networks with intersimilarity.
Real data show that interdependent networks usually involve intersimilarity. Intersimilarity means that a pair of interdependent nodes have neighbors in both networks that are also interdependent [Parshani et al. Europhys. Lett. 92, 68002 (2010)]. For example, the coupled worldwide port network and the global airport network are intersimilar since many pairs of linked nodes (neighboring cities)...
متن کاملGroup percolation in interdependent networks
Zexun Wang, 2, ∗ Dong Zhou, ∗ and Yanqing Hu 4, † School of Data and Computer Science, Sun Yat-sen University, Guangzhou 510006, China Big Data Research Center,University of Electronic Science and Technology of China, Chengdu 611731, China Simula Research Laboratory, 1325 Lysaker, Norway Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 611731, China (D...
متن کاملPercolation in real interdependent networks
The function of a real network depends not only on the reliability of its own components, but is a ected also by the simultaneous operation of other real networks coupled with it. Whereas theoretical methods of direct applicability to real isolated networks exist, the frameworks developed so far in percolation theory for interdependent network layers are of little help in practical contexts, as...
متن کاملPercolation of interdependent network of networks
Complex networks appear in almost every aspect of science and technology. Previous work in network theory has focused primarily on analyzing single networks that do not interact with other networks, despite the fact that many real-world networks interact with and depend on each other. Very recently an analytical framework for studying the percolation properties of interacting networks has been ...
متن کاملPercolation of partially interdependent scale-free networks.
We study the percolation behavior of two interdependent scale-free (SF) networks under random failure of 1-p fraction of nodes. Our results are based on numerical solutions of analytical expressions and simulations. We find that as the coupling strength between the two networks q reduces from 1 (fully coupled) to 0 (no coupling), there exist two critical coupling strengths q(1) and q(2), which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2013
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.88.052805